A multi-dimensional block-circulant perfect array construction

نویسندگان

  • Samuel T. Blake
  • Andrew Z. Tirkel
چکیده

We present a N-dimensional generalization of the two-dimensional block-circulant perfect array construction by [Blake, 2013]. As in [Blake, 2013], the families of N-dimensional arrays possess pairwise good zero correlation zone (ZCZ) cross-correlation. Both constructions use a perfect autocorre-lation sequence with the array orthogonality property (AOP). This paper presents a generalization of the 2-dimensional block-circulant array construction by [Blake, 2013]. The generalized construction works in any number of dimensions, but is limited to the same size in each dimension as the original two-dimensional construction. Throughout the paper we follow the notation of [Blake, 2013]. We begin by stating the 2-dimensional construction for families of arrays with perfect autocorrelation and good cross-correlation as given in [Blake, 2013]. Construction I Let a = [a 0 , a 1 , · · · , a n−1 ] be a perfect sequence with the AOP for the divisor, d, and and c = [c(0), c(1), · · · , c(d − 1)] is a block of d perfect sequences – each of length m, where m = 0 mod d. We construct a family of arrays, S k , such that S k = [S i,j ] k = a j c(j mod d) w⌊j/d⌋+k(j mod d)+i for 0 ≤ i < n, 0 ≤ j < m, a has the AOP for the divisor d, 0 < k ≤ m, and w = m/d. This construction produces perfect arrays up to size r 2 × r 2 over r roots of unity. Each pair of distinct arrays has d 2 non-zero cross-correlation values, as d ≪ r we say the array has good ZCZ cross-correlation. The generalized N-dimensional construction is given as follows. Construction II Let a = [a 0 , a 1 , · · · , a n−1 ] be a perfect sequence with the AOP for the divisor, d, and c = [c(0), c(1), · · · , c(d − 1)] is a block of d perfect sequences – each of length m, where m = 0 mod d. We construct a family of k N-dimensional perfect arrays, S k , such that S k = S i0,i1,··· ,iN−2,j k = a j N −2 v=0 c(j mod d) w⌊j/d⌋+k(j mod d)+iv Each distinct pair of arrays from the family has d 2 non-zero cross-correlation values, regardless of the size of N. Thus, the ratio of zero to non-zero cross-correlation values …

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Arrays over roots of unity with perfect autocorrelation and good ZCZ cross-correlation

We present a new construction for two-dimensional, perfect autocorrelation arrays over roots of unity. These perfect arrays are constructed from a block of perfect column sequences. Other blocks are constructed from the first block, to generate a block-circulant structure. The columns are then multiplied by a perfect sequence over roots of unity, which, when folded into an array commensurate wi...

متن کامل

On the perfect 1-factorisation problem for circulant graphs of degree 4

A 1-factorisation of a graph G is a partition of the edge set of G into 1factors (perfect matchings); a perfect 1-factorisation of G is a 1-factorisation of G in which the union of any two of the 1-factors is a Hamilton cycle in G. It is known that for bipartite 4-regular circulant graphs, having order 2 (mod 4) is a necessary (but not sufficient) condition for the existence of a perfect 1-fact...

متن کامل

Fast Hankel tensor-vector product and its application to exponential data fitting

This paper is contributed to a fast algorithm for Hankel tensor–vector products. First, we explain the necessity of fast algorithms for Hankel and block Hankel tensor–vector products by sketching the algorithm for both one-dimensional and multi-dimensional exponential data fitting. For proposing the fast algorithm, we define and investigate a special class of Hankel tensors that can be diagonal...

متن کامل

Sine transform based preconditioners for elliptic problems

We consider applying the preconditioned conjugate gradient (PCG) method to solve linear systems Ax = b where the matrix A comes from the discretization of second-order elliptic operators. Let (L +)) ?1 (L t +) denote the block Cholesky factorization of A with lower block triangular matrix L and diagonal block matrix. We propose a preconditioner M = (^ L +)) ?1 (^ L t +) with block diagonal matr...

متن کامل

On Advisability of Designing Short Length QC-LDPC Codes Using Perfect Difference Families

A simple and general definition of quasi cyclic low-density parity-check (QC-LDPC) codes which are constructed based on circulant permutation matrices (CPM) is proposed. As an special case of this definition, we first represent one type of so called combinatorially designed multiple-edge protograph codes. The code construction is mainly based on perfect difference families (PDF’s) and is called...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Adv. in Math. of Comm.

دوره 11  شماره 

صفحات  -

تاریخ انتشار 2017